Separating layered treewidth and row treewidth

Layered treewidth and row are recently introduced graph parameters that have been key ingredients in the solution of several well-known open problems. It follows from definitions layered a is at most its plus 1. Moreover, minor-closed class has bounded if only it treewidth. However, whether by function This paper answers this question negative. In particular, for every integer $k$ we describe with 1 $k$. We also prove an analogous result pathwidth pathwidth.